Pebbling Results and Graph Analogues of the KKM Lemma
نویسندگان
چکیده
In the summer of 2004, I participated in an REU program at East Tennessee State University. Many of the investigations I worked on were successful, leading to 4-6 papers, some of which have been submitted, and others are still in the writing process. There are many unanswered questions left in the investigations that I was conducting, and some of the work already done is not complete. Given that my original thesis topic also is in graph theory, my new intention is to work simultaneously on questions based upon my REU research as well as with the previous problem I desired to tackle. This proposal will describe each of the these general areas.
منابع مشابه
Graph Rubbling: an Extension of Graph Pebbling
Graph Rubbling: An Extension of Graph Pebbling Christopher Andrew Belford Place a whole number of pebbles on the vertices of a simple, connected graph G; this is called a pebble distribution. A rubbling move consists of removing a total of two pebbles from some neighbor(s) of a vertex v of G and placing a single pebble on v. A vertex v of G is called reachable from an initial pebble distributio...
متن کاملRecent Applications of the Fan-kkm Theorem
In this review, firstly, we recall Ky Fan’s contributions to the KKM theory based on his celebrated 1961 KKM lemma (or the Fan-KKM theorem). Secondly, we introduce relatively recent applications of the Fan lemma due to other authors in the 21st century. Finally, some historical remarks on related works are added.
متن کاملSperner and Kkm-type Theorems on Trees and Cycles
In this paper we prove a new combinatorial theorem for labellings of trees, and show that it is equivalent to a KKM-type theorem for finite covers of trees and to discrete and continuous fixed point theorems on finite trees. This is in analogy with the equivalence of the classical Sperner’s lemma, KKM lemma, and the Brouwer fixed point theorem on simplices. Furthermore, we use these ideas to de...
متن کاملA Simple Proof of the Sion Minimax Theorem
For convex subsets X of a topological vector space E, we show that a KKM principle implies a Fan-Browder type fixed point theorem and that this theorem implies generalized forms of the Sion minimax theorem. The von Neumann-Sion minimax theorem is fundamental in convex analysis and in game theory. von Neumann [8] proved his theorem for simplexes by reducing the problem to the 1-dimensional cases...
متن کاملA Survey of Graph Pebbling
We survey results on the pebbling numbers of graphs as well as their historical connection with a number-theoretic question of Erdős and Lemke. We also present new results on two probabilistic pebbling considerations, first the random graph threshold for the property that the pebbling number of a graph equals its number of vertices, and second the pebbling threshold function for various natural...
متن کامل